On Restrictions on Transformational Grammars Reducing the Generative Power
نویسنده
چکیده
Various restrictions on transformational grammars have been investigated in order to reduce their generative power from recursively enumerable languages to recursive languages. It will be shown that any restriction on transformational grammars defining a recursively enumerable subset of the set of all transformational grammars, is either too weak (in the sense that there does not exist a general decision procedure for all languages generated under such a restriction) or too strong (in the sense that there exists a recursive language that cannot be generated by any transformational grammar thus restricted). In addition, some related problems will be discussed.
منابع مشابه
On the Generative Power of
Mathematical modeling of phrase structure grammars has yielded many results of benefit to linguists in their investigation of these grammars, such as Chomsky’s characterization in terms of self-embedding of those context-free languages which are not regular. The recent shift of focus in linguistic theory to transformational grammars has not been accompanied by a similar application of mathemati...
متن کاملOn the Emergence of Scientific Grammar in Iran
Writing the grammar of a language is one of the most significant outputs of linguistic studies. In Iran, it is Avicenna (Ibn-e Sina) who is credited with the first such compilation of the Persian language. Understanding the weaknesses associated with the traditional trends of grammar writing in Iran, contemporary Iranian linguists adopted the modern Western approach following the Chomskyan Turn...
متن کاملTwo Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars
The present paper introduces and discusses generalized scattered context grammars that are based upon sequences of productions whose left-hand sides are formed by nonterminal strings, not just single nonterminals. It places two restrictions on the derivations in these grammars. More specifically, let k be a positive integer. The first restriction requires that all rewritten symbols occur within...
متن کاملLocality Conditions and the Complexity of Minimalist Grammars: A Preliminary Survey
Among the well-established variety of formal grammar types providing a mildly context-sensitive grammar (MCSG) formalism in the sense of Joshi (1985), Stabler’s minimalist grammars (MGs) (Stabler 1997, 1999) come closest to modeling the tools used in the Chomskyan branch of generative syntax known as “minimalism” (Chomsky 1995, 2000, 2001). Interestingly, without there being a rise in (at least...
متن کاملThe Generative Power of Categorial Grammars and Head-Driven Phrase Structure Grammars with Lexical Rules
In this paper, it is shown that the addition of simple and linguistically motivated forms of lexical rules to grammatical theories based on subcategorization lists, such as categorial grammars (CG) or head-driven phrase structure grammars (HPSG), results in a system that can generate all and only the recursively enumerable languages. The proof of this result is carried out by means of a reducti...
متن کامل